Fully Flexible Parallel Merge Sort for Multicore Architectures
نویسندگان
چکیده
منابع مشابه
Parallel Merge Sort for Distributed Memory Architectures Parallel Merge Sort for Distributed Memory Architectures Ii Contents 1 Introduction 1 2 Cole's Parallel Merge Sort: the Crew Algorithm 1 3 Implementing the Crew Algorithm on a Distributed Memory Ar- Chitecture 7
Cole presented a parallel merge sort for the PRAM model that performs in O log n parallel steps using n processors He gave an algorithm for the CREW PRAM model for which the constant in the running time is small He also gave a more complex version of the algorithm for the EREWPRAM the constant factor in the running time is still moderate but not as small In this paper we give an approach to imp...
متن کاملParallel Sort-merge-join Reasoning
We present an in-memory, cross-platform, parallel reasoner for RDFS and RDFSPlus . Inferray uses carefully optimized hash-based join and sorting algorithms to perform parallel materialization. Designed to take advantage of the architecture of modern CPUs, Inferray exhibits a very good uses of cache and memory bandwidth. It offers state-of-theart performance on RDFS materialization, outperforms ...
متن کاملMerge Path – Cache-Efficient Parallel Merge and Sort
Merging two sorted arrays is a prominent building block for sorting and other functions. Its efficient parallelization requires balancing the load among compute cores, minimizing the extra work brought about by parallelization, and minimizing inter-thread synchronization requirements. Due to the extremely low compute to memoryaccess ratio, it is also critically important to efficiently utilize ...
متن کاملParallel Algorithms and Structures for Implementation of Merge Sort
I. INTODACTION The development of information technologies is characterized by the expansion of applications, many of which requires parallel sorting of data sets in real-time. You can provide such data sorting by using of specialized tools, which architecture maps the structure of the sorting algorithm on hardware and is oriented on VLSI implementation. Implementation of highly efficient speci...
متن کاملMerge Sort
Bingheng Wang Dept. of Computer Science Florida Institute of Technology Melbourne FL 32904 [email protected] ABSTRACT Given a list of elements, we rearrange the list with ascending or descending order. So far the existing approaches involve Bubble Sort, Insertion Sort, Selection Sort ( respectively in worst case) performing slow. Now we introduce a new algorithm Merge Sort to solve the problem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complexity
سال: 2018
ISSN: 1076-2787,1099-0526
DOI: 10.1155/2018/8679579